nLab typal equality

Context

Type theory

natural deduction metalanguage, practical foundations

  1. type formation rule
  2. term introduction rule
  3. term elimination rule
  4. computation rule

type theory (dependent, intensional, observational type theory, homotopy type theory)

syntax object language

computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory

logicset theory (internal logic of)category theorytype theory
propositionsetobjecttype
predicatefamily of setsdisplay morphismdependent type
proofelementgeneralized elementterm/program
cut rulecomposition of classifying morphisms / pullback of display mapssubstitution
introduction rule for implicationcounit for hom-tensor adjunctionlambda
elimination rule for implicationunit for hom-tensor adjunctionapplication
cut elimination for implicationone of the zigzag identities for hom-tensor adjunctionbeta reduction
identity elimination for implicationthe other zigzag identity for hom-tensor adjunctioneta conversion
truesingletonterminal object/(-2)-truncated objecth-level 0-type/unit type
falseempty setinitial objectempty type
proposition, truth valuesubsingletonsubterminal object/(-1)-truncated objecth-proposition, mere proposition
logical conjunctioncartesian productproductproduct type
disjunctiondisjoint union (support of)coproduct ((-1)-truncation of)sum type (bracket type of)
implicationfunction set (into subsingleton)internal hom (into subterminal object)function type (into h-proposition)
negationfunction set into empty setinternal hom into initial objectfunction type into empty type
universal quantificationindexed cartesian product (of family of subsingletons)dependent product (of family of subterminal objects)dependent product type (of family of h-propositions)
existential quantificationindexed disjoint union (support of)dependent sum ((-1)-truncation of)dependent sum type (bracket type of)
logical equivalencebijection setobject of isomorphismsequivalence type
support setsupport object/(-1)-truncationpropositional truncation/bracket type
n-image of morphism into terminal object/n-truncationn-truncation modality
equalitydiagonal function/diagonal subset/diagonal relationpath space objectidentity type/path type
completely presented setsetdiscrete object/0-truncated objecth-level 2-type/set/h-set
setset with equivalence relationinternal 0-groupoidBishop set/setoid with its pseudo-equivalence relation an actual equivalence relation
equivalence class/quotient setquotientquotient type
inductioncolimitinductive type, W-type, M-type
higher inductionhigher colimithigher inductive type
-0-truncated higher colimitquotient inductive type
coinductionlimitcoinductive type
presettype without identity types
set of truth valuessubobject classifiertype of propositions
domain of discourseuniverseobject classifiertype universe
modalityclosure operator, (idempotent) monadmodal type theory, monad (in computer science)
linear logic(symmetric, closed) monoidal categorylinear type theory/quantum computation
proof netstring diagramquantum circuit
(absence of) contraction rule(absence of) diagonalno-cloning theorem
synthetic mathematicsdomain specific embedded programming language

homotopy levels

semantics

Equality and Equivalence

Foundations

foundations

The basis of it all

 Set theory

set theory

Foundational axioms

foundational axioms

Removing axioms

Contents

 Idea

In dependent type theory, the term typal equality is used to describe the use of the identity type to represent the notion of equality of terms, and is primarily used to distinguish from the notion of judgmental equality of terms.

In dependent type theories with a separate proposition judgment ϕprop\phi \mathrm{prop}, the term typal equality is also used to distinguish identity types from propositional equality, which is the equality judged to be a proposition; i.e. a= Abpropa =_A b \mathrm{prop}. On the other hand, in dependent type theory without a separate proposition judgment, propositions are usually defined to be certain types, and the term “propositional equality” is used as a synonym of typal equality in referring to identity types. (In fact, “propositional equality” is the older and arguably still more common term in this context.)

In dependent type theory with type variables and identity types between types, in the absence of the univalence axiom, the term typal equality is also used for types to distinguish between when two types are typally equal via the identity type between the two types and when two types are equivalent to each other.

Parallels between judgmental equality and typal equality

The parallels between the structural rules for judgmental equality and typal equality in dependent type theory with type variables are shown below:

judgmental equalitytypal equality
judgmental equality of termsidentification between terms
reflexivity of judgmental equality of termsidentity identification between terms
symmetry of judgmental equality of termsinverse identification between terms
transitivity of judgmental equality of termsconcatenation of identifications between terms
judgmental equality of typesidentification between types
reflexivity of judgmental equality of typesidentity identification between types
symmetry of judgmental equality of typesinverse identification between types
transitivity of judgmental equality of typesconcatenation of identification between types
principle of substitutionaction on identifications

 See also

Last revised on December 17, 2024 at 15:39:31. See the history of this page for a list of all contributions to it.